Analysing Java's safety guarantees under concurrency
نویسندگان
چکیده
منابع مشابه
Analysing Safety Functions and Barriers
The paper gives a summary of approaches to describing and modelling safety characteristics, including safety functions and barriers. In three examples, the safety function concept has been used to describe how actual safety systems worked. The examples are an incident investigation, a safety analysis of a part of a pharmaceutical plant, and safety rules in the railway industry. Advantages and d...
متن کاملSafety Guarantees from Explicit Resource Management
We present a language and a program analysis that certifies the safe use of flexible resource management idioms, in particular advance reservation or “block booking” of costly resources. This builds on previous work with resource managers that carry out runtime safety checks, by showing how to assist these with compile-time checks. We give a small ANF-style language with explicit resource manag...
متن کاملAsynchronous Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics
As robots become more versatile, they are increasingly found to operate together in the same environment where they must coordinate their motion in a distributed manner. Such operation does not present problems if the motion is quasi-static and collisions can be easily avoided. However, when the robots follow second-order dynamics, the problem becomes challenging even for a known environment. T...
متن کاملUnsynchronized Distributed Motion Planning with Safety Guarantees under Second - Order Dynamics
Unsynchronized Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics by Devin Kieber Grady Robots are increasingly found to operate together in the same environment where they must coordinate their motion. Such an operation is simple if the motion is quasi-static. Under second-order dynamics, the problem becomes challenging even for a known environment. Planning must gu...
متن کاملModular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacerbate this problem, because threads interfere more often and in richer ways. In this paper we provide a thread-modular safety checker for a class of pointermanipulating fine-grained concurrent algorithms. Our checker u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: it – Information Technology
سال: 2014
ISSN: 1611-2776,2196-7032
DOI: 10.1515/itit-2013-1037